Generalized Inverses in Public Key Cryptosystem Design
نویسندگان
چکیده
We point out, in this paper, that the theory of generalized inverses of matrices over nite elds is a potential tool in cryptographic research, by proposing a public key cryptosystem. We analyse some properties of the public key cryptosystem and compare them with those of McEliece's public key cryptosystem. The idea is similar to that of McEliece's public key cryptosystem in terms of the usage of an error correction process. However, by using the techniques of generalized matrices, the Hamming weight of the error pattern in the cryptosystem is far larger than the error correction capability of the employed error-correcting code. This is the main reason for the key size to be smaller than that of McEliece's public key cryptosystem with the same level of security. It is also anticipated that the theory of generalized inverses can be used for a large variety of cryptographic applications.
منابع مشابه
Three Novel Theorems for Applied Cryptography
With advancements in computing capabilities public key cryptosystems are going to be more complex yet vulnerable over the modern day‟s computer networks and associated security mechanism, especially those based on novel approaches of applied mathematics. This paper explores three novel theorems derived while studying and implementing RSA algorithm, one of the strongest public key cryptosystem. ...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملPublic key cryptosystems based on boolean permutations and their applications
In this paper we propose the use of Boolean permutations to design public key cryptosystems. The security of the cryptosystems is based on the diiculty of inverting Boolean permutations. Using two Boolean permutations for which the inverses are easy to nd, one can construct a composite Boolean permutation which is hard to invert. The paper proposes three such Boolean permutation based public ke...
متن کاملQuantum McEliece public-key cryptosystem
The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantumMcEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the clas...
متن کامل